Making weak memory models fair

Liveness properties, such as termination, of even the simplest shared-memory concurrent programs under sequential consistency typically require some fairness assumptions about scheduler. Under weak memory models, we observe that standard notions thread are insufficient, and an additional property, which call fairness, is needed. In this paper, propose a uniform definition for can be integrated into any declarative model enforcing acyclicity union program order reads-from relation. For well-known SC, x86-TSO, RA, StrongCOH, have equivalent operational presentations, show our condition to intuitive model-specific notion requires system fairly execute its internal propagation steps. Our preserves correctness local transformations compilation scheme from RC11 also enables first formal proofs termination mutual exclusion lock implementations models.